On (s, t)-supereulerian graphs in locally highly connected graphs

نویسندگان

  • Lan Lei
  • Xiao-Min Li
  • Bin Wang
  • Hong-Jian Lai
چکیده

Given two nonnegative integers s and t , a graph G is (s, t)-supereulerian if for any disjoint sets X, Y ⊂ E(G) with |X | ≤ s and |Y | ≤ t , there is a spanning eulerian subgraph H of G that contains X and avoids Y . We prove that if G is connected and locally k-edge-connected, thenG is (s, t)-supereulerian, for any pair of nonnegative integers s and t with s+t ≤ k−1. We further show that if s + t ≤ k and G is a connected, locally k-edge-connected graph, then for any disjoint sets X, Y ⊂ E(G)with |X | ≤ s and |Y ≤ t , there is a spanning eulerian subgraph H that contains X and avoids Y , if and only if G− Y is not contractible to K2 or to K2,l with l odd. © 2009 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supereulerian graphs with width s and s-collapsible graphs

For an integer s > 0 and for u, v ∈ V (G) with u ≠ v, an (s; u, v)-trail-system of G is a subgraphH consisting of s edge-disjoint (u, v)-trails. A graph is supereulerianwithwidth s if for any u, v ∈ V (G) with u ≠ v, G has a spanning (s; u, v)-trail-system. The supereulerian width μ(G) of a graph G is the largest integer s such that G is supereulerian with width k for every integer kwith 0 ≤ k ...

متن کامل

Supereulerian planar graphs

We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoint spanning trees, then G is supereulerian except a few classes of graphs. This is applied to show the existence of spanning Eulerian subgraphs in planar graphs with small edge cut conditions. We also determine several...

متن کامل

On 3-edge-connected supereulerian graphs in graph family C(l, k)

Let l > 0 and k ≥ 0 be two integers. Denote by C(l, k) the family of 2-edge-connected graphs such that a graph G ∈ C(l, k) if and only if for every bond S ⊂ E(G) with |S| ≤ 3, each component of G − S has order at least (|V (G)| − k)/l. In this paper we prove that if a 3-edge-connected graph G ∈ C(12, 1), then G is supereulerian if and only if G cannot be contracted to the Petersen graph. Our re...

متن کامل

Supereulerian graphs and matchings

A graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α(G) be the maximum number of independent edges in the graph G. In this paper, we show that if G is a 2-edge-connected simple graph and α(G) ≤ 2, then G is supereulerian if and only if G is not K2,t for some odd number t . © 2011 Elsevier Ltd. All rights reserved.

متن کامل

Lai's Conditions for Spanning and Dominating Closed Trails

A graph is supereulerian if it has a spanning closed trail. For an integer r, let Q0(r) be the family of 3-edge-connected nonsupereulerian graphs of order at most r. For a graph G, define δL(G) = min{max{d(u), d(v)}| for any uv ∈ E(G)}. For a given integer p > 2 and a given real number , a graph G of order n is said to satisfy a Lai’s condition if δL(G) > np − . In this paper, we show that if G...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 310  شماره 

صفحات  -

تاریخ انتشار 2010